Balanced Ternary Vector-Matrix Multiplication on a Ternary Optical Computer
نویسنده
چکیده
This paper proposes an optical method to perform a balanced ternary vector-matrix multiplication. Inspired by ternary optical computer‘s ability to process ternary information, we study techniques to realize ternary vector-matrix multiplication (VMM) based on the work of manipulating binary VMM computation. The principle and specific working flow is described in detail and the correctness of this method is verified by experimentation. The advantage of optical VMM and the superiorities of ternary VMM are discussed.
منابع مشابه
Algebras with ternary law of composition and their realization by cubic matrices
We study partially and totally associative ternary algebras of first and second kind. Assuming the vector space underlying a ternary algebra to be a topological space and a triple product to be continuous mapping we consider the trivial vector bundle over a ternary algebra and show that a triple product induces a structure of binary algebra in each fiber of this vector bundle. We find the suffi...
متن کاملTruncated ternary multipliers
Balanced ternary number representation and arithmetic, based on the symmetric radix-3 digit set {−1, 0, +1}, has been studied at various times in the history of computing. Among established advantages of balanced ternary arithmetic are representational symmetry, favourable error characteristics and rounding by truncation. In this study, we show an additional advantage: that of lower-error trunc...
متن کاملTernary Multiplication Circuits Using 4-Input Adder Cells and Carry Look-Ahead
We introduce a new implementation of a ternary adder with four inputs and two outputs. This ternary adder reduces the number of digits in a multiplication compared with a binary multiplication. One advantage of the ternary adder is that four instead of three inputs within a binary representation will be summed up. In this paper we will compare the complexity of binary against ternary multiplier...
متن کاملTernary codes through ternary designs
It is known that under certain conditions the incidence matrix of a balanced incomplete block design (v, b, r, k, λ) gives a binary code of length b and size 2(v + 1). Here we investigate the conditions where a balanced ternary design gives a similar ternary code.
متن کاملTHE LATTICE OF CONGRUENCES ON A TERNARY SEMIGROUP
In this paper we investigate some properties of congruences on ternary semigroups. We also define the notion of congruence on a ternary semigroup generated by a relation and we determine the method of obtaining a congruence on a ternary semigroup T from a relation R on T. Furthermore we study the lattice of congruences on a ternary semigroup and we show that this lattice is not generally modular...
متن کامل